Adopt: asynchronous distributed constraint optimization with quality guarantees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ADOPT: Asynchronous Distributed Constraint Optimization with Quality Guarantees ADOPT: Asynchronous Distributed Constraint Optimization with Quality Guarantees

The Distributed Constraint Optimization Problem (DCOP) is able to model a wide variety of distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while allowing agents to operate asynchronously. We show how this failure can be remedied by allowing agents to make local decisio...

متن کامل

Adopt: asynchronous distributed constraint optimization with quality guarantees

The Distributed Constraint Optimization Problem (DCOP) is a promising approach for modeling distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while allowing agents to operate asynchronously. We show how this failure can be remedied by allowing agents to make local decis...

متن کامل

HOWTO: Asynchronous PFC-MRDAC -Optimization in Distributed Constraint Problems±Adopt-

Each agent has private problems. Private concerns can often be formulated in a general framework such as constraint satisfaction (where everything is modeled by either variables, values, or constraints). Often agents need to find agreement with others for the allocation of final resources. The constraint satisfaction (CSPs) is only a special case of optimization. Here it is shown how a very gen...

متن کامل

Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees

Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their practical applicability. Here we present some distributed algorithms for these problems when they are arranged in a tree of agents. The exact algorithm, DCTE, computes the optimal solution but requires messages of size ...

متن کامل

ADOPT-ng: Unifying Asynchronous Distributed Optimization with Asynchronous Backtracking

This article presents an asynchronous algorithm for solving Distributed Constraint Optimization problems (DCOPs). The proposed technique unifies asynchronous backtracking (ABT) and asynchronous distributed optimization (ADOPT) where valued nogoods enable more flexible reasoning and more opportunities of communication, leading to an important speed-up. The concept of valued nogood is an extensio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2005

ISSN: 0004-3702

DOI: 10.1016/j.artint.2004.09.003